A denotational semantics for the symmetric interaction combinators
نویسندگان
چکیده
منابع مشابه
A denotational semantics for the symmetric interaction combinators
The symmetric interaction combinators are a variant of Lafont’s interaction combinators. They enjoy a weaker universality property with respect to interaction nets, but are equally expressive. They are a model of deterministic distributed computation, sharing the good properties of Turing machines (elementary reductions) and of the λ-calculus (higher-order functions, parallel execution). We int...
متن کاملEdifices and Full Abstraction for the Symmetric Interaction Combinators
The symmetric interaction combinators are a variant of Lafont’s interaction combinators. They are a graph-rewriting model of parallel deterministic computation. We define a notion analogous to that of head normal form in the λ-calculus, and make a semantical study of the corresponding observational equivalence. We associate with each net a compact metric space, called edifice, and prove that tw...
متن کاملFrom Geometry of Interaction to Denotational Semantics
We analyze the categorical foundations of Girard’s Geometry of Interaction Program for Linear Logic. The motivation for the work comes from the importance of viewing GoI as a new kind of semantics and thus trying to relate it to extant semantics. In an earlier paper we showed that a special case of Abramsky’s GoI situations–ones based on Unique Decomposition Categories (UDC’s)–exactly captures ...
متن کاملA Denotational Semantics for Circus
Circus specifications define both data and behavioural aspects of systems using a combination of Z and CSP. Previously, a denotational semantics has been given to Circus; however, as a shallow embedding of Circus in Z, it was not possible to use it to prove properties like the refinement laws that justify the distinguishing development technique associated with Circus. This work presents a fina...
متن کاملA Denotational Semantics for Curry
We aim to build a denotational semantics for the functional logic programming language Curry, to be used for parametricity and logical relation arguments. First, we investigate only a subset of Curry, but include the important features that separate Curry from a just functional language. We compare a poweralgebraic and a multialgebraic semantic approach and motivate our decision for the multial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2007
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129507006135